Worst-Case Analysis of Weber's Algorithm
نویسندگان
چکیده
Recently, Ken Weber introduced an algorithm for finding the (a, b)-pairs satisfying au + bv ≡ 0 (mod k), with 0 < |a|, |b| < √ k, where (u, k) and (v, k) are coprime. It is based on Sorenson’s and Jebelean’s “k-ary reduction” algorithms. We provide a formula for N(k), the maximal number of iterations in the loop of Weber’s GCD algorithm.
منابع مشابه
Worst-case analysis of Weber's GCD algorithm
Recently, Ken Weber introduced an algorithm for finding the (a, b)-pairs satisfying au+ bv ≡ 0 (mod k), with 0< |a|, |b| < √ k, where (u, k) and (v, k) are coprime. It is based on Sorenson’s and Jebelean’s “k-ary reduction” algorithms. We provide a formula for N(k), the maximal number of iterations in the loop of Weber’s GCD algorithm. 1999 Elsevier Science B.V. All rights reserved.
متن کاملOptimal Portfolio Selection for Tehran Stock Exchange Using Conditional, Partitioned and Worst-case Value at Risk Measures
This paper presents an optimal portfolio selection approach based on value at risk (VaR), conditional value at risk (CVaR), worst-case value at risk (WVaR) and partitioned value at risk (PVaR) measures as well as calculating these risk measures. Mathematical solution methods for solving these optimization problems are inadequate and very complex for a portfolio with high number of assets. For t...
متن کاملA path following interior-point algorithm for semidefinite optimization problem based on new kernel function
In this paper, we deal to obtain some new complexity results for solving semidefinite optimization (SDO) problem by interior-point methods (IPMs). We define a new proximity function for the SDO by a new kernel function. Furthermore we formulate an algorithm for a primal dual interior-point method (IPM) for the SDO by using the proximity function and give its complexity analysis, and then we sho...
متن کاملTime and Space Complexity Reduction of a Cryptanalysis Algorithm
Binary Decision Diagram (in short BDD) is an efficient data structure which has been used widely in computer science and engineering. BDD-based attack in key stream cryptanalysis is one of the best forms of attack in its category. In this paper, we propose a new key stream attack which is based on ZDD(Zero-suppressed BDD). We show how a ZDD-based key stream attack is more efficient in time and ...
متن کاملWorst-case analysis of generalized heapsort algorithm revisited
In this paper we present a generalized heapsort algorithm and its worst-case complexity analysis. The weighted sum of the number of comparisons and movements has been defined as a measure of the complexity. Theoretical analysis suggests that, by this criterion, 3-heap should be optimal in the worst case, contradicting the findings of A. Paulik (Paulik, A., 1990, Worst-case analysis of a general...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1311.7369 شماره
صفحات -
تاریخ انتشار 2013